18.304 Undergraduate Seminar in Discrete Mathematics, Spring 2006

Author(s)
Kleitman, Daniel
Thumbnail
Download18-304-spring-2006/contents/index.htm (35.11Kb)
Alternative title
Undergraduate Seminar in Discrete Mathematics
Terms of use
Usage Restrictions: This site (c) Massachusetts Institute of Technology 2016. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. Usage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unported http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
Abstract
This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.
Date issued
2006-06
URI
http://hdl.handle.net/1721.1/100853
Department
Massachusetts Institute of Technology. Department of Mathematics
Other identifiers
18.304-Spring2006
local: 18.304
local: IMSCP-MD5-0f59190f6bbbe4bba8d047b6b4876075
Keywords
discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing, discrete math, discrete mathematics, discrete, math, mathematics, seminar, presentations, student presentations, oral, communication, stable marriage, dych, emergency, response vehicles, ambulance, game theory, congruences, color theorem, four color, cake cutting, algorithm, RSA, encryption, numberical integration, sorting, post correspondence problem, PCP, ramsey, van der waals, fibonacci, recursion, domino, tiling, towers, hanoi, pigeonhole, principle, matrix, hamming, code, hat game, juggling, zero-knowledge, proof, repeated games, lewis carroll, determinants, infinitude of primes, bridges, konigsberg, koenigsberg, time series analysis, GARCH, rational, recurrence, relations, digital, image, compression, quantum computing, discrete math, discrete mathematics, discrete, math, mathematics, seminar, presentations, student presentations, oral, communication, stable marriage, dych, emergency, response vehicles, ambulance, game theory, congruences, color theorem, four color, cake cutting, algorithm, RSA, encryption, numberical integration, sorting, post correspondence problem, PCP, ramsey, van der waals, fibonacci, recursion, domino, tiling, towers, hanoi, pigeonhole, principle, matrix, hamming, code, hat game, juggling, zero-knowledge, proof, repeated games, lewis carroll, determinants, infinitude of primes, bridges, konigsberg, koenigsberg, time series analysis, GARCH, rational, recurrence, relations, digital, image, compression, quantum computing
Collections